Learning to Schedule Multi-Server Jobs With Fluctuated Processing Speeds

نویسندگان

چکیده

Multi-server jobs are imperative in modern cloud computing systems. A noteworthy feature of multi-server is that, they usually request multiple devices simultaneously for their execution. How to schedule online with a high system efficiency topic great concern. First, the scheduling decisions have satisfy service locality constraints. Second, needs be made without knowledge future job arrivals. Third, and most importantly, actual rate experienced by fluctuation because dynamic voltage frequency scaling (DVFS) power oversubscription techniques when types co-locate. majority algorithms theoretical performance guarantees proposed. However, them require processing speeds knowable, thereby completion times can exactly calculated. To present theoretically guaranteed algorithm knowing apriori, this article, we propose Esdp (Efficient Sampling-based Dynamic Programming), which learns distribution fluctuated over time seeks maximize cumulative overall utility. The utility formulated as sum utilities successfully serving each minus penalty on operating, maintaining, energy cost. proved polynomial complexity logarithmic regret, State-of-the-Art result. We also validate it extensive simulations results show that proposed outperforms several benchmark policies improvements up 73%, 36%, 28%, respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster Jobs in Distributed Data Processing using Multi-Task Learning

Slow running or straggler tasks in distributed processing frameworks [1, 2] can be 6 to 8 times slower than the median task in a job on a production cluster [3], despite existing mitigation techniques. This leads to extended job completion times, inefficient use of resources, and increased costs. Recently, proactive straggler avoidance techniques [4] have explored the use of predictive models t...

متن کامل

The makespan problem of scheduling multi groups of jobs on multi processors at different speeds

In the paper we mainly study the makespan problem of scheduling n groups of jobs on n special-purpose processors and m general-purpose processors at different speeds. We first propose an improved LPT algorithm and investigate several properties of this algorithm. We then obtain an upper bound for the ratio of the approximate solution T to the optimal solution T ∗ under the improved LPT algorithm.

متن کامل

Consistency aware update schedule in multi-server Distributed Virtual Environments

Multi-server architecture is very popular in Distributed Virtual Environments. Although multi-server architecture has good scalability, the load balance and consistency are still challenging issues. Because of server resource limitations (computation, communication etc), the consistency of the virtual world cannot be guaranteed sometimes. In this paper, we address this problem by developing sch...

متن کامل

Using the Greedy Approach to Schedule Jobs in a Multi-Cluster System

Clusters, multi-cluster systems and the grid are becoming popular high performance computing infrastructures. How jobs are scheduled on them greatly influence the performance. Since jobs are online in most computer systems, they are scheduled when the entire information about them is unknown. We propose a greedy scheduling algorithm that uses both arrival order and how hard a job is to schedule...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems

سال: 2023

ISSN: ['1045-9219', '1558-2183', '2161-9883']

DOI: https://doi.org/10.1109/tpds.2022.3215947